About the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem
نویسنده
چکیده
The purpose of this paper is to show that the gap is possibly smaller than 2. Some helpful results are summarized. Zusammenfassung: Es werden Ergebnisse vorgestellt und diskutiert, die bei der Untersuchung der maximalen Differenz zwischen den Optimalwerten des ganzzahligen und stetigen eindimensionalen Zuschnittproblems erhalten wurden.
منابع مشابه
Families of Non-irup Instances of the One-dimensional Cutting Stock Problem Families of Non-irup Instances of the One-dimensional Cutting Stock Problem
In case of the one-dimensional cutting stock problem (CSP) one can observe for any instance a very small gap between the integer optimal value and the continuous relaxation bound. These observations have initiated a series of investigations. An instance possesses the integer roundup property (IRUP) if its gap is smaller than 1. It is well-known that there exist instances of the CSP having a gap...
متن کاملNumerical investigations on the MIRUP of the 2-stage guillotine cutting stock problem
The MIRUP (Modified Integer Round-Up Property) leads to an upper bound for the gap between the optimal value of the integer problem and that of the corresponding continuous relaxation rounded up. This property is known to hold for many instances of the one-dimensional cutting stock problem but there are not known so far any results with respect to the two-dimensional case. In this paper we inve...
متن کاملNumerical investigations on the MIRUP of the 2 - stage guillotine cutting stock
The MIRUP (Modiied Integer RoundUp Property) leads to an upper bound for the gap between the optimal value of the integer problem and that of the corresponding continuous relaxation rounded up. This property is known to hold for many instances of the one-dimensional cutting stock problem but there are not known so far any results with respect to the two-dimensional case. In this paper we invest...
متن کاملSolving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...
متن کاملAls Manuskript Gedruckt Technische Universität Dresden Herausgeber: Der Rektor Theoretical Investigations on the Modified Integer Round-up Property for the One-dimensional Cutting Stock Problem
Many numerical computations show an only small difference between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992